Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation

نویسندگان

  • Wlodzimierz Bielecki
  • Tomasz Klimek
  • Konrad Trifunovic
چکیده

Abstract: An approach to calculate the exact transitive closure of a parameterized and normalized affine integer tuple relation is presented. A relation is normalized when it describes graphs of the chain topology only. A procedure of the normalization is attached. The exact transitive closure calculation is based on resolving a system of recurrence equations being formed from the input and output tuples of a normalized relation. The approach permits for calculating an exact transitive closure for a relation when the constraints of this closure are represented by both affine and non-linear forms. Examples of calculating the exact transitive closure of normalized affine integer tuple relations are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations

The set of paths in a graph is an important concept with many applications in system analysis. In the context of integer tuple relations, which can be used to represent possibly infinite graphs, this set corresponds to the transitive closure of the relation representing the graph. Relations described using only affine constraints and projection are fairly efficient to use in practice and captur...

متن کامل

Computing the Transitive Closure of a Union of Affine Integer Tuple Relations

This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to compute the transitive closure exist for convex polyhedra only. In presence of non-convex relations, there exist little but special cases and incomplete heuristics. We introduce a novel sufficient and necessary condition defining ...

متن کامل

Transitive Closure of Innnite Graphs and Its Applications Transitive Closure of Innnite Graphs and Its Applications

Integer tuple relations can concisely summarize many types of information gathered from analysis of scientiic codes. For example they can be used to precisely describe which iterations of a statement are data dependent of which other iterations. It is generally not possible to represent these tuple relations by enumerating the related pairs of tuples. For example, it is impossible to enumerate ...

متن کامل

Counting Affine Calculator and Applications

We present an interactive tool, called iscc, for manipulating sets and relations of integer tuples bounded by affine constraints over the set variables, parameters and existentially quantified variables. A distinguishing feature of iscc is that it provides a cardinality operation on sets and relations that computes a symbolic expression in terms of the parameters and domain variables for the nu...

متن کامل

Approximating the Transitive Closure of a Boolean Affine Relation

Boolean affine relations, which combine affine inequalities by boolean connectives are ubiquitous in all kind of static program analyzes. One of the crucial operations on such relations is transitive closure, which is closely related to the construction of loop inductive invariants. I present here a new over-approximation algorithm, which has the interesting property of being extendible for inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2009